Multi-State Real-Time Bidirectional Search
نویسندگان
چکیده
منابع مشابه
State Abstraction in Real-time Heuristic Search: The Director’s Cut
Real-time heuristic search methods are used by situated agents in applications that require the amount of planning per move to be independent of the problem size. Such agents plan only a few actions in a local search space and avoid getting trapped in local minima by improving their heuristic function over time. We extend a wide class of real-time search algorithms with automatically built stat...
متن کاملCobot: Real Time Multi User Conversational Search and Recommendations
Cobot is a new intelligent agent platform that connects users through real-time and off-line conversations about their health and medical issues. Intelligent web based information agents (conversational/community bots) participate in each conversation providing highly-relevant real-time informational recommendations and connecting people with relevant conversations and other community members. ...
متن کاملTwo is Not Always Better than One: Experiences in Real-Time Bidirectional Search
This paper investigates real-time bidirectional search (RTBS) algorithms, where two problem solving agents, starting from the initial and goal states, physically move toward each other. To evaluate the RTBS performance, two kinds of algorithms, centralized RTBS and decoupled RTBS, are proposed and are compared to real-time unidirectional search (RTUS). Experiments on mazes and n-puzzles show th...
متن کاملReal-Time Heuristic Search
We apply the two-pluyer game assumprio~ls of 1i111ited search horizon and cornn~itnrent to nroves i constant time, to .single-agent heuristic search problems. We present a varicrtion of nrinimcr lookuhead search, and an analog to ulphu-betu pruning rlrot signijicantly improves the efficiency c. the algorithm. Paradoxically. the search horizon reachuble with this algorithm increases wir. increus...
متن کاملBidirectional Preference-Based Search for State Space Graph Problems
In multiobjective state space graph problems, each solution-path is evaluated by a cost vector. These cost vectors can be partially or completely ordered using a preference relation compatible with Pareto dominance. In this context, multiobjective preference-based search (MOPBS) aims at computing the preferred feasible solutions according to a predefined preference model, these preferred soluti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2004
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.19.68